Polynomial solvability of $NP$-complete problems
نویسنده
چکیده
A polynomial algorithm for solving the ”Hamiltonian circuit” problem is presented in the paper. Computational complexity of the algorithm is equal to O ( n log 2 n ) where n is the cardinality of the observed graph vertex set. Thus the polynomial solvability for NP -complete problems is proved.
منابع مشابه
Expressing an NP-Complete Problem as the Solvability of a Polynomial Equation
We demonstrate a polynomial approach to express the decision version of the directed Hamiltonian Cycle Problem (HCP), which is NP-Complete, as the Solvability of a Polynomial Equation with a constant number of variables, within a bounded real space. We first introduce four new Theorems for a set of periodic Functions with irrational periods, based on which we then use a trigonometric substituti...
متن کاملM ay 2 00 8 Independence of P vs . NP in regards to oracle
Previously in “P is a proper subset of NP” [Meek Article 1, 2008] and “Analysis of the Deterministic Polynomial Time Solvability of the 0-1-Knapsack Problem” [Meek Article 2, 2008] the present author has demonstrated that some NP-complete problems are likely to have no deterministic polynomial time solution. In this article the concepts of these previous works will be applied to the relativizat...
متن کاملComplexity and Unsolvability Properties of Nilpotency
A nonassociative algebra is nilpotent if there is some n such that the product of any n elements, no matter how they are associated, is zero. Several related, but more general, notions are left nilpotency, solvability, local nilpotency, and nillity. First the complexity of several decision problems for these properties is examined. In finite-dimensional algebras over a finite field it is shown ...
متن کاملCombining Uni cation- and Disuni cation Algorithms|Tractable and Intractable Instances
We consider the problem of combining procedures that decide solvability of (dis)uniication problems over disjoint equational theories. Partial answers to the following questions are given: Which properties of the component theories imply intractability in the sense that there cannot be a polynomial combination algorithm, assuming P 6 = NP? Which general properties of the component theories guar...
متن کاملThe Complexity of the List Partition Problem for Graphs
The k-partition problem is as follows: Given a graph G and a positive integer k, partition the vertices of G into at most k parts A1, A2, . . . , Ak, where it may be specified that Ai induces a stable set, a clique, or an arbitrary subgraph, and pairs Ai, Aj (i = j) be completely nonadjacent, completely adjacent, or arbitrarily adjacent. The list k-partition problem generalizes the k-partition ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1409.0375 شماره
صفحات -
تاریخ انتشار 2014